Parametric Branch and Bound
نویسنده
چکیده
The paper describes a procedure for mixed integer programming that allows branches to be imposed 'by degrees', which can subsequently be revised or weeded out according to their relative influence. It is an adaptive approach in which the branch and bound tree can be maillipulated and rl'Structured. The approach also yields measures of the costs of imposing the branches that lead to integer solutions, thus providing a built-in form of sensitivity analysis for evaluating the effect of integer
منابع مشابه
A parametric branch and bound approach to suboptimal explicit hybrid MPC
In this article we present a parametric branch and bound algorithm for computation of optimal and suboptimal solutions to parametric mixed-integer quadratic programs and parametric mixed-integer linear programs. The algorithm returns an optimal or suboptimal parametric solution with the level of suboptimality requested by the user. An interesting application of the proposed parametric branch an...
متن کاملEuropean Journal of Operational Research Parametric Uncapacitated Facility Location
We consider the parametric Uncapacitated Facility Location Problem (UFLP) where the demand of each customer is allowed to vary over a certain interval. Despite the value of parametric analysis, no such efforts are found for the UFLP, that mainly seems to be due to the fact that parametric analysis usually requires the computation of a number of UFLP's with heavy computational burden. In this pa...
متن کاملParametric tabu-search for mixed integer programs
Aparametric form of tabu-search is proposed for solvingmixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying branching inequalities as weighted terms in the objective function. The approach extends and modifies a parametric branch and bound procedure of Glover [Parametic branch and bound. OMEGA, The International Journal of Manag...
متن کاملSurrogate Branching: Parametric Relaxation for Mixed Integer Optimization
Surrogate Branching (SB) methods in mixed integer optimization provide a staged parametric relaxation of customary branching methods used in branch-and-bound and branch-and-cut algorithms. SB methods operate by forming surrogate constraints composed of non-negative linear combinations of component inequalities of three types: (1) ordinary branching inequalities, (2) redundant inequalities invol...
متن کاملParametric mixed-integer 0-1 linear programming: The general case for a single parameter
Two algorithms for the general case of parametric mixed-integer linear programs (MILPs) are proposed. Parametric MILPs are considered in which a single parameter can simultaneously influence the objective function, the right-hand side and the matrix. The first algorithm is based on branch-and-bound on the integer variables, solving a parametric linear program (LP) at each node. The second algor...
متن کامل